On the isomorphism problem for cyclic combinatorial objects
نویسندگان
چکیده
منابع مشابه
On an Algorithm for Isomorphism-Free Generations of Combinatorial Objects
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set k n consisting of all n n binary matrices having exactly k 1's in every row and every column without perambulating all elements. In the described algorithm bitwise operations are substantially ...
متن کاملCombinatorial invariants for graph isomorphism problem
Presented approach in polynomial time calculates large number of invariants for each vertex, which won’t change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting vertex, what can be though as the diagonal terms of k-th power of the adjacency matrix. For k = 2 we would get degree of verities invariant, higher describes...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Isomorphism Problem for Cyclic Algebras and Its Application
The isomorphism problem means to decide if two given finitedimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational aspects of representation theory, algebraic geometry and Brauer group theory. The paper presents an algorithm for cyclic algebras that reduces the isomorphism ...
متن کاملOn the Automorphism Groups and Equivalence of Cyclic Combinatorial Objects
We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial objects on p elements are equivalent.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)90119-x